Performing Tasks on Restartable Message-Passing Processors
نویسندگان
چکیده
1 Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland. chlebus@mimu., edu.pl 2 Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square NE43-368, Cambridge, MA 02139, USA. robdep@theory. Ics. mit. edu Department of Computer Science and Engineering, University of Connecticut, 191 Auditorium Road, U-155, Storrs, CT 06269, USA. aas@eng2, uconn, edu
منابع مشابه
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work...
متن کاملPronto: A Low Overhead Message Passing System for High Performance Many-Core Processors
Many-core processors provide the raw computation power required by modern high-performance multimedia and signal processing workloads. The conversion of this computation power into execution performance is often constrained by the overheads of communication between concurrent tasks. This paper presents Pronto, a low overhead message passing system which simplifies the semantics of data movement...
متن کاملSingle Round Simulation on Radio Networks
A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors. A processor receives a message in a given step if and only if it is silent then and precisely one of its neighbors transmits. This stringent rule poses serious difficulties in performing even the simplest tasks. This is true even under the overly optimistic assumptions of central...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملCooperative computing with fragmentable and mergeable groups
This work considers the problem of performing a set of N tasks on a set of P message-passing processors P N . The processors use a group communication service (GCS) to coordinate their activity in the setting with dynamic network changes. We investigate work-efficient and message-efficient algorithms for fragmentations and merges of processor groups. We present an algorithm that has work (defin...
متن کامل